منابع مشابه
Chopped random-basis quantum optimization
In this work, we describe in detail the chopped random basis (CRAB) optimal control technique recently introduced to optimize time-dependent density matrix renormalization group simulations [P. Doria, T. Calarco, and S. Montangero, Phys. Rev. Lett. 106, 190501 (2011)]. Here, we study the efficiency of this control technique in optimizing different quantum processes and we show that in the consi...
متن کاملBasis Optimization Renormalization Group for Quantum Hamiltonian
A method of Hamiltonian diagonalization is suitable for calculating physical quantities associated with wavefunctions, such as structure functions and form factors. However, we cannot diagonalize Hamiltonian directly in quantum field theories because dimension of Hilbert space is generally infinite. To create effective Hamiltonian, we extend a technique of NRG (numerical renormalization group) ...
متن کاملCoherent State Quantum Key Distribution Without Random Basis Switching
The random switching of measurement bases is commonly assumed to be a necessary step of quantum key distribution protocols. In this paper we show that switching is not required for coherent state continuous variable quantum key distribution. We show this via the no-switching protocol which results in higher information rates and a simpler experimental setup. We propose an optimal eavesdropping ...
متن کاملPhase space optimization of quantum representations: Direct-product basis sets
The quantitative phase space similarities between the uniformly mixed ensembles of eigenstates, and the quasiclassical Thomas–Fermi distribution, are exploited in order to generate a nearly optimal basis representation for an arbitrary quantum system. An exact quantum optimization functional is provided, and the minimum of the corresponding quasiclassical functional is proposed as an excellent ...
متن کاملThe Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective
Among various algorithms designed to exploit the specific properties of quantum computers with respect to classical ones, the quantum adiabatic algorithm is a versatile proposition to find the minimal value of an arbitrary cost function (ground state energy). Random optimization problems provide a natural testbed to compare its efficiency with that of classical algorithms. These problems corres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2011
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.84.022326